Uniform and monotone line sum optimization
نویسندگان
چکیده
The line sum optimization problem asks for a ( 0 , 1 ) -matrix minimizing the of given functions evaluated at its row and column sums. We show that uniform problem, with identical functions, monotone over matrices nonincreasing sums, are polynomial time solvable.
منابع مشابه
Variational Sum of Monotone Operators
The sum of (nonlinear) maximal monotone operators is reconsidered from the Yosida approximation and graph-convergence point of view. This leads to a new concept, called variational sum, which coincides with the classical (pointwise) sum when the classical sum happens to be maximal monotone. In the case of subdiierentials of convex lower semicontinuous proper functions, the variational sum is eq...
متن کاملOn Multidimensional and Monotone k-SUM
The well-known k-SUM conjecture is that integer k-SUM requires time Ω(ndk/2e−o(1)). Recent work has studied multidimensional k-SUM in Fp, where the best known algorithm takes time Õ(ndk/2e). Bhattacharyya et al. [ICS 2011] proved a min(2Ω(d), nΩ(k)) lower bound for k-SUM in Fp under the Exponential Time Hypothesis. We give a more refined lower bound under the standard k-SUM conjecture: for suff...
متن کاملUniform Interpolation for Monotone Modal Logic
We reconstruct the syntax and semantics of monotone modal logic, in the style of Moss’ coalgebraic logic. To that aim, we replace the box and diamond with a modality ∇ which takes a finite collection of finite sets of formulas as its argument. The semantics of this modality in monotone neighborhood models is defined in terms of a version of relation lifting that is appropriate for this setting....
متن کاملRooted Uniform Monotone Minimum Spanning Trees
We study the construction of the minimum cost spanning geometric graph of a given rooted point set P where each point of P is connected to the root by a path that satisfies a given property. We focus on two properties, namely the monotonicity w.r.t. a single direction (y-monotonicity) and the monotonicity w.r.t. a single pair of orthogonal directions (xy-monotonicity). We propose algorithms tha...
متن کاملOnline Monotone Optimization
This paper presents a new framework for analyzing and designing noregret algorithms for dynamic (possibly adversarial) systems. The proposed framework generalizes the popular online convex optimization framework and extends it to its natural limit allowing it to capture a notion of regret that is intuitive for more general problems such as those encountered in game theory and variational inequa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2021
ISSN: ['1872-6771', '0166-218X']
DOI: https://doi.org/10.1016/j.dam.2021.04.008